The best possible upper bound on the probability of undetected error for linear codes of full support
نویسندگان
چکیده
Abstract—There is a known best possible upper bound on the probability of undetected error for linear codes. The [n, k; q] codes with probability of undetected error meeting the bound have support of size k only. In this note, linear codes of full support (= n) are studied. A best possible upper bound on the probability of undetected error for such codes is given, and the codes with probability of undetected error meeting this bound are characterized.
منابع مشابه
A Sharp Sufficient Condition for Sparsity Pattern Recovery
Sufficient number of linear and noisy measurements for exact and approximate sparsity pattern/support set recovery in the high dimensional setting is derived. Although this problem as been addressed in the recent literature, there is still considerable gaps between those results and the exact limits of the perfect support set recovery. To reduce this gap, in this paper, the sufficient con...
متن کاملQuantum error detection II: Bounds
In Part I of this paper we formulated the problem of error detection with quantum codes on the completely depolarized channel and gave an expression for the probability of undetected error via the weight enumerators of the code. In this part we show that there exist quantum codes whose probability of undetected error falls exponentially with the length of the code and derive bounds on this expo...
متن کاملUndetected Error Probability for Quantum Codes
Abstract From last fourteen years the work on undetected error probability for quantum codes has been silent. The undetected error probability has been discussed by Ashikhmin [3] in which it was proved that the average probability of undetected error for a given code is essentially given by a function of its weight enumerators. In this paper, new upper bounds on undetected error probability for...
متن کاملOn the undetected error probability of linear block codes on channels with memory
In the first part of the correspondence we derive an upper bound on the undetected error probability of binary ( n , k ) block codes used on channels with memory described by Markov distributions. This bound is a generalization of the bound presented by Kasami et al. for the binary symmetric channel, and is given as an average value of some function of the composition of the state sequence of t...
متن کاملOn asymptotics of certain sums arising in coding theory
Recently, T. Kllve IEEE IT, 41, 1995] analyzed the average worst case probability of undetected error for linear n; k; q] codes of length n and dimension k over an alphabet of size q. The following sum S n = P n i=1 ? n i (i=n) i (1 ? i=n) n?i arose, which has also some other applications in coding theory, average case analysis of algorithms, and combinatorics. T. Kllve conjectured an asymptoti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1102.2350 شماره
صفحات -
تاریخ انتشار 2011